Optimal Weighted Load Balancing in TCAMs

Traffic splitting is a required functionality in networks, for example load balancing over multiple paths or among different servers. The capacities of the servers determine partition by which traffic should be split. A recent approach implements within ternary content addressable memory (TCAM), often available switches. It important to reduce amount allocated this task since TCAMs are power consuming and also other tasks such as classification routing. Previous work showed how compute smallest prefix-matching TCAM necessary implement given exactly. In paper we solve more practical case, where at most $n$ rules available, restricting ability exactly desired partition. We give simple efficient algorithms find that generate closest notation="LaTeX">$L_\infty $ one. do same one-sided version equals maximum overload on server relative it. use our evaluate expected error changes function number rules, servers, width TCAM.